Centraliser codes

نویسندگان
چکیده

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

The Index of a Lie Algebra, the Centraliser of a Nilpotent Element, and the Normaliser of the Centraliser

This definition goes back to J.Dixmier, see [Di, 11.1.6]. He considered index because of its importance in Representation Theory. The problem of computing the index may also be treated as part of Invariant Theory. For, if q is an algebraic Lie algebra and Q is a corresponding algebraic group, then ind q equals the transcendence degree of the field of Q-invariant rational functions on q. If q is...

متن کامل

The symplectic ideal and a double centraliser theorem

We interpret a result of Oehms as a statement about the symplectic ideal. We use this result to prove a double centraliser theorem for the symplectic group acting on ⊕s r=0 ⊗ V , where V is the natural module for the symplectic group. This result was obtained in characteristic zero by Weyl. Furthermore, we use this to extend to arbitrary connected reductive groups G with simply connected derive...

متن کامل

Some Optimal Codes From Designs

The binary and ternary codes spanned by the rows of the point by block incidence matrices of some 2-designs and their complementary and orthogonal designs are studied. A new method is also introduced to study optimal codes.

متن کامل

Isotropic Constant Dimension Subspace Codes

 In network code setting, a constant dimension code is a set of k-dimensional subspaces of F nq . If F_q n is a nondegenerated symlectic vector space with bilinear form f, an isotropic subspace U of F n q is a subspace that for all x, y ∈ U, f(x, y) = 0. We introduce isotropic subspace codes simply as a set of isotropic subspaces and show how the isotropic property use in decoding process, then...

متن کامل

One-point Goppa Codes on Some Genus 3 Curves with Applications in Quantum Error-Correcting Codes

We investigate one-point algebraic geometric codes CL(D, G) associated to maximal curves recently characterized by Tafazolian and Torres given by the affine equation yl = f(x), where f(x) is a separable polynomial of degree r relatively prime to l. We mainly focus on the curve y4 = x3 +x and Picard curves given by the equations y3 = x4-x and y3 = x4 -1. As a result, we obtain exact value of min...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: Linear Algebra and its Applications

سال: 2014

ISSN: 0024-3795

DOI: 10.1016/j.laa.2014.08.024